Progenitor delay-time distribution of short gamma-ray bursts: Constraints from observations

Context. The progenitors of short gamma-ray bursts (SGRBs) have not yet been well identified. The most popular model is the merger of compact object binaries (NS-NS/NS-BH). However, other progenitor models cannot be ruled out. The delay-time distribution of SGRB progenitors, which is an important property to constrain progenitor models, is still poorly understood. Aims. We aim to better constrain the luminosity function of SGRBs and the delay-time distribution of their progenitors with newly discovered SGRBs. Methods. We present a low-contamination sample of 16 Swift SGRBs that is better defined by a duration shorter than 0.8 s. By using this robust sample and by combining a self-consistent star formation model with various models for the distribution of time delays, the redshift distribution of SGRBs is calculated and then compared to the observational data. Results. We find that the power-law delay distribution model is disfavored and that only the lognormal delay distribution model with the typical delay tau >= 3 Gyr is consistent with the data. Comparing Swift SGRBs with T90 > 0.8 s to our robust sample (T90 < 0.8 s), we find a significant difference in the time delays between these two samples. Conclusions. Our results show that the progenitors of SGRBs are dominated by relatively long-lived systems (tau >= 3 Gyr), which contrasts the results found for Type Ia supernovae. We therefore conclude that primordial NS-NS systems are not favored as the dominant SGRB progenitors. Alternatively, dynamically formed NS-NS/BH and primordial NS-BH systems with average delays longer than 5 Gyr may contribute a significant fraction to the overall SGRB progenitors.Comment: 8 pages, 6 figures, Astron. Astrophys. in pres

Cross-Lingual Semantic Role Labeling with High-Quality Translated Training Corpus

Many efforts of research are devoted to semantic role labeling (SRL) which is crucial for natural language understanding. Supervised approaches have achieved impressing performances when large-scale corpora are available for resource-rich languages such as English. While for the low-resource languages with no annotated SRL dataset, it is still challenging to obtain competitive performances. Cross-lingual SRL is one promising way to address the problem, which has achieved great advances with the help of model transferring and annotation projection. In this paper, we propose a novel alternative based on corpus translation, constructing high-quality training datasets for the target languages from the source gold-standard SRL annotations. Experimental results on Universal Proposition Bank show that the translation-based method is highly effective, and the automatic pseudo datasets can improve the target-language SRL performances significantly.Comment: Accepted at ACL 202

Using ACL2 to Verify Loop Pipelining in Behavioral Synthesis

Behavioral synthesis involves compiling an Electronic System-Level (ESL) design into its Register-Transfer Level (RTL) implementation. Loop pipelining is one of the most critical and complex transformations employed in behavioral synthesis. Certifying the loop pipelining algorithm is challenging because there is a huge semantic gap between the input sequential design and the output pipelined implementation making it infeasible to verify their equivalence with automated sequential equivalence checking techniques. We discuss our ongoing effort using ACL2 to certify loop pipelining transformation. The completion of the proof is work in progress. However, some of the insights developed so far may already be of value to the ACL2 community. In particular, we discuss the key invariant we formalized, which is very different from that used in most pipeline proofs. We discuss the needs for this invariant, its formalization in ACL2, and our envisioned proof using the invariant. We also discuss some trade-offs, challenges, and insights developed in course of the project.Comment: In Proceedings ACL2 2014, arXiv:1406.123